Function Optimization with Latent Variable Models

نویسندگان

  • Soo-Yong Shin
  • Dong-Yeon Cho
  • Byoung-Tak Zhang
چکیده

Most of estimation of distribution algorithms (EDAs) try to represent explicitly the relationship between variables with factorization techniques or with graphical models such as Bayesian networks. In this paper, we propose to use latent variable models such as Helmholtz machine and probabilistic principal component analysis for capturing the probabilistic distribution of given data. The latent variable models are statistical models that specify the relationships between a set of random variables and a set of latent variables; Latent variables are not directly observable and there are a smaller number of variables in latent variables than in input variables. In statistics latent variable models are used for density estimation. Since latent variable models are generative models, it is easy to sample a new data. Our experimental results support that the proposed latent variable models can find good solutions more efficiently than other EDAs for continuous functions.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Using multivariate generalized linear latent variable models to measure the difference in event count for stranded marine animals

BACKGROUND AND OBJECTIVES: The classification of marine animals as protected species makes data and information on them to be very important. Therefore, this led to the need to retrieve and understand the data on the event counts for stranded marine animals based on location emergence, number of individuals, behavior, and threats to their presence. Whales are g...

متن کامل

Parameter constraints in generalized linear latent variable models

Parameter constraints in generalized linear latent variable models are discussed. Both linear equality and inequality constraints are considered. Maximum likelihood estimators for the parameters of the constrained model and corrected standard errors are derived. A significant reduction in the dimension of the optimization problem is achieved with the proposed methodology for fitting models subj...

متن کامل

Build, Compute, Critique, Repeat: Data Analysis with Latent Variable Models

We survey how to use latent variable models to solve data analysis problems. A latent variable model is a probabilistic model of hidden and observed variables, where the hidden variables encode hidden patterns in our data. We uncover these patterns through the posterior, the conditional distribution of the hidden variables given the observations, which we use to explore, summarize, and form pre...

متن کامل

Improving classification with latent variable models by sequential constraint optimization

In this paper we propose a method to use multiple generative models with latent variables for classi cation tasks. The standard approach to use generative models for classi cation is to train a separate model for each class. A novel data point is then classi ed by the model that attributes the highest probability. The algorithm we propose modi es the parameters of the models to improve the clas...

متن کامل

Generalized Majorization-Minimization

Non-convex optimization is ubiquitous in machine learning. The MajorizationMinimization (MM) procedure systematically optimizes non-convex functions through an iterative construction and optimization of upper bounds on the objective function. The bound at each iteration is required to touch the objective function at the optimizer of the previous bound. We show that this touching constraint is u...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001